Online Set Cover with Set Requests
نویسندگان
چکیده
We consider a generic online allocation problem that generalizes the classical online set cover framework by considering requests comprising a set of elements rather than a single element. This problem has multiple applications in cloud computing, crowd sourcing, facility planning, etc. Formally, it is an online covering problem where each online step comprises an offline covering problem. In addition, the covering sets are capacitated, leading to packing constraints. We give a randomized algorithm for this problem that has a nearly tight competitive ratio in both objectives: overall cost and maximum capacity violation. Our main technical tool is an online algorithm for packing/covering LPs with nested constraints, which may be of interest in other applications as well. 1998 ACM Subject Classification F.2.2 Non-numerical Algorithms and Problems
منابع مشابه
Algorithms for Optimization Problems on Networks and Graphs (Shai Gutner, Ph.D. Thesis)
There is substantial literature dealing with online and approximation algorithms for network problems. In this work we study various optimization problems, focusing on admission control, approximate counting of small subgraphs within large graphs, the minimum dominating set problem, and the prize collecting generalized Steiner forest problem. We first address in Chapter 1 the admission control ...
متن کاملOn the Advice Complexity of the Set Cover Problem
Recently, a new approach to get a deeper understanding of online computation has been introduced: the study of the advice complexity of online problems. The idea is to measure the information that online algorithms need to be supplied with to compute high-quality solutions and to overcome the drawback of not knowing future input requests. This concept was successfully applied to many prominent ...
متن کاملAutomatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کاملOn Maximum Coverage in the Streaming Model & Application to Multi-topic Blog-Watch
We generalize the graph streaming model to hypergraphs. In this streaming model, hyperedges are arriving online and any computation has to be done on-the-fly using a small amount of space. Each hyperedge can be viewed as a set of elements (nodes), so we refer to our proposed model as the “set-streaming” model of computation. We consider the problem of “maximum coverage”, in which k sets have to...
متن کامل“At least one” caching
We consider a variant of the caching problem, where each request is a set of pages of a fixed size, instead of a single page. In order to serve such a request, we require at least one of those pages to be present in the cache. Each page is assumed to have unit size and unit cost for getting loaded into the cache. We prove lower bounds on the competitive ratio for this problem in both the determ...
متن کامل